Static versus dynamic reversibility in CCS
نویسندگان
چکیده
منابع مشابه
Static VS Dynamic Reversibility in CCS
The notion of reversible computing is attracting interest because of its applications in diverse fields, in particular the study of programming abstractions for fault tolerant systems. Reversible CCS (RCCS), proposed by Danos and Krivine, enacts reversibility by means of memory stacks. Ulidowski and Phillips proposed a general method to reverse a process calculus given in a particular SOS forma...
متن کاملstatic versus dynamic assessment of l2 learners’ reading ability
dynamic assessment according to vygotskys sociocultural theory, states that instruction and assessment are interrelated. using static forms of assessment with second and foreign language students could do more harm than good. many teachers neglect to take account of the complexity involved in learning a second or foreign language and often wonder why learning of a language take so long. thi...
Static Versus Dynamic Sampling for Data Mining
As data warehouses grow to the point where one hundred gigabytes is considered small, the computational efficiency of data-mining algorithms on large databases becomes increasingly important. Using a sample from the database can speed up the datamining process, but this is only acceptable if it does not reduce the quality of the mined knowledge. To this end, we introduce the “Probably Close Eno...
متن کاملDynamic versus Static Hadronic Structure Functions ?
“Static” structure functions are the probabilistic distributions computed from the square of the light-front wavefunctions of the target hadron. In contrast, the “dynamic” structure functions measured in deep inelastic lepton-hadron scattering include the effects of rescattering associated with the Wilson line. Initialand final-state rescattering, neglected in the parton model, can have a profo...
متن کاملCCS Dynamic Bisimulation is Progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. α.τ.β.nil and α.β.nil are woc but τ.β.nil and β.nil are not. This fact prevents us from characterizing CCS semantics (when τ is considered invisible) as a final algebra, since the semantic function would induce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2019
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-019-00346-6